Ring Compute-and-Forward Over Block-Fading Channels

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compute-and-Forward for Block-Fading Channels via Algebraic Lattice Codes

Previous approaches to compute-and-forward (C&F) are mostly based on quantizing channel coefficients to integers. In this work, we investigate the C&F strategy over block fading channels using Construction A over rings, so as to allow better quantization for the channels. Advantages in decoding error probabilities and computation rates are demonstrated, and the construction is shown to outperfo...

متن کامل

Block-fading Channels

Collaborative techniques have been proposed to improve communications in the presence of a hostile jammer. A distributed detection and decoding technique based on collaborative decoding has been shown to be effective for communications over non-fading channels for coherent communications. In this paper, we consider collaborative communications strategies for jamming channels in which the messag...

متن کامل

Performance of Hybrid ARQ Schemes over Multipath Block Fading Channels

The use of Hybrid Automatic Repeat reQuest (HARQ) for error correction has been given wide attention in the High Speed Downlink Packets Access (HSDPA) mode of the UMTS (3GPP TR 25.848 2001). This paper derives a theoretical analysis of the performance of Automatic Repeat reQuest (ARQ) and Type I Hybrid ARQ (HARQ I) over a block multipath Rayleigh fading channel. It is shown that the derived ana...

متن کامل

Performance Analysis of Coded Systems over Block Fading Channels

This paper considers the performance analysis of binary coded systems over block fading (BF) channels. In the transmitter, the coded bits are interleaved prior to transmission to spread burst errors resulting from deeply faded blocks. The union bound on the bit error probability (BEP) is derived assuming uniform interleaving and using the weight enumerator of the code. The union bound is a func...

متن کامل

Coded Modulation with Mismatched CSIT over Block-Fading Channels

Reliable communication over delay-constrained block-fading channels with discrete inputs and mismatched (imperfect) channel state information at the transmitter (CSIT) is studied. The CSIT mismatch is modeled as Gaussian random variables, whose variances decay as a power of the signal-to-noise ratio (SNR). A special focus is placed on the large-SNR decay of the outage probability when power con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2019

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2019.2927453